Fuzzy c-Means Classifier for Large Scale Data
نویسندگان
چکیده
منابع مشابه
A Fuzzy C-means Algorithm for Clustering Fuzzy Data and Its Application in Clustering Incomplete Data
The fuzzy c-means clustering algorithm is a useful tool for clustering; but it is convenient only for crisp complete data. In this article, an enhancement of the algorithm is proposed which is suitable for clustering trapezoidal fuzzy data. A linear ranking function is used to define a distance for trapezoidal fuzzy data. Then, as an application, a method based on the proposed algorithm is pres...
متن کاملParallel Fuzzy c-Means Clustering for Large Data Sets
The parallel fuzzy c-means (PFCM) algorithm for clustering large data sets is proposed in this paper. The proposed algorithm is designed to run on parallel computers of the Single Program Multiple Data (SPMD) model type with the Message Passing Interface (MPI). A comparison is made between PFCM and an existing parallel k-means (PKM) algorithm in terms of their parallelisation capability and sca...
متن کاملWeighted Fuzzy-Possibilistic C-Means Over Large Data Sets
Up to now, several algorithms for clustering large data sets have been presented. Most clustering approaches for data sets are the crisp ones, which cannot be well suitable to the fuzzy case. In this paper, the authors explore a single pass approach to fuzzy possibilistic clustering over large data set. The basic idea of the proposed approach (weighted fuzzy-possibilistic c-means, WFPCM) is to ...
متن کاملIdentification of Diabetic Retinopathy Stages using Fuzzy C-means Classifier
Diabetic Retinopathy (DR) is globally the primary cause of visual impairment and blindness in diabetic patients. Diabetic retinopathy occurs when the small blood vessels have a high level of glucose in the retina. That causes a change in the retina, which occur over a period of time in diabetics and cause the difficulties with vision. Regular screening is essential in order to detect the early ...
متن کاملFuzzy c-means clustering of incomplete data
The problem of clustering a real s-dimensional data set X={x(1 ),,,,,x(n)} subset R(s) is considered. Usually, each observation (or datum) consists of numerical values for all s features (such as height, length, etc.), but sometimes data sets can contain vectors that are missing one or more of the feature values. For example, a particular datum x(k) might be incomplete, having the form x(k)=(25...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Japan Society for Fuzzy Theory and Intelligent Informatics
سال: 2010
ISSN: 1881-7203,1347-7986
DOI: 10.3156/jsoft.22.792